منابع مشابه
On the greedy walk problem
This note introduces a greedy walk on Poisson and Binomial processes which is a close relative to the well known greedy server model. Some open problems are presented.
متن کاملSpatially Non-uniform Random Walk on the Real Line
The random walk is a mathematical counterpart of a Brownian particle system and has been used as a powerful theoretical tool to understand random dispersal phenomena. If temperature is not spatially constant, the mean free path and the traveling time for the path has variation in space. In this paper we investigate behavior of a simple random walk having spatially dependent walk length and jump...
متن کاملGreedy Random Walk
We study a discrete time self interacting random process on graphs, which we call Greedy Random Walk. The walker is located initially at some vertex. As time evolves, each vertex maintains the set of adjacent edges touching it that have not been crossed yet by the walker. At each step, the walker being at some vertex, picks an adjacent edge among the edges that have not traversed thus far accor...
متن کاملQuantum Walk on the Line
Motivated by the immense success of random walk and Markov chain methods in the design of classical algorithms, we consider quantum walks on graphs. We analyse in detail the behaviour of unbiased quantum walk on the line, with the example of a typical walk, the “Hadamard walk”. In particular, we show that after t time steps, the probability distribution on the line induced by the Hadamard walk ...
متن کاملPOINTWISE PSEUDO-METRIC ON THE L-REAL LINE
In this paper, a pointwise pseudo-metric function on the L-realline is constructed. It is proved that the topology induced by this pointwisepseudo-metric is the usual topology.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 2015
ISSN: 0091-1798
DOI: 10.1214/13-aop898